Reversibility in the higher-order π-calculus

The notion of reversible computation is attracting increasing interest becauseof its applications in diverse fields, in particular the study of programmingabstractions for reliable systems. In this paper, we continue the study un-dertaken by Danos and Krivine on reversible CCS by defining a reversiblehigher-order π-calculus, called rhoπ. We prove that reversibility in our cal-culus is causally consistent and that the causal information used to supportreversibility in rhoπ is consistent with the one used in the causal semanticsof the π-calculus developed by Boreale and Sangiorgi. Finally, we show thatone can faithfully encode rhoπ into a variant of higher-order π, substantiallyimproving on the result we obtained in the conference version of this paper.